Constructing an Initial Basic Feasible Solution
ثبت نشده
چکیده
and that the three demand constraints also sum up to this same expression. It follows that it is sufficient to work with any subset of 5 out of these 6 equations. To understand what this means more explicitly, suppose we are given a proposed solution to the original equations, and we are asked to check whether or not the given solution is feasible. To answer this, we would have to substitute the proposed solution into the equations one by one. Now, observe that if the proposed solution is verified to satisfy the first 5 equations, then the equality of the sum of the supply equations and the sum of the demand equations implies that the proposed solution must also satisfy the last equation. Moreover, it should be clear that this
منابع مشابه
Some new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملA Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points
An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...
متن کاملA New Approach to Solve Transportation Problems
Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.
متن کاملA Novel Approach for Optimization of Transportation Problem in Chaos Environment
Nature is characterized by its chaotic behavior. Mathematics is considered one of the appropriate tools to achieve the best definition of possible its chaos variables and process. Classical mathematics deals with the numbers as static and meaningless, but chaos mathematics deals with it as dynamic evolutionary, and value- added. This paper attempts to introduce the transportation problem re...
متن کاملChapter 6 , Operations Research ( OR )
Maximize ZD = b T y s.t. (D) A y + s = c, s ≥ 0n. where we have here chosen to add slack variables s ≥ 0n. The simplex method, as presented previously, works by starting with an initial basic feasible solution to (P) (which can be found via a phase 1 problem). However, what if a dual feasible basis is immediately available, whereas a basic feasible solution to (P) is harder to obtain? Can this ...
متن کامل